Machine-Independent Complexity Theory
نویسنده
چکیده
This chapter provides an accessible and straightforward tour through some of the most basic notions and remarkable phenomena in machine-independent computational complexity. It includes versions of the recursion, compression, speedup, gap, union, and honesty theorems. Where possible, the results are derived from machine-dependent ones, in the particularly convenient concrete setting of space-bounded Turing ma chines.
منابع مشابه
A Formal Proof of Borodin-Trakhtenbrot's Gap Theorem
In this paper, we discuss the formalization of the well known Gap Theorem of Complexity Theory, asserting the existence of arbitrarily large gaps between complexity classes. The proof is done at an abstract, machine independent level, and is particularly aimed to identify the minimal set of assumptions required to prove the result (smaller than expected, actually). The work is part of a long te...
متن کاملMAN-MACHINE INTERACTION SYSTEM FOR SUBJECT INDEPENDENT SIGN LANGUAGE RECOGNITION USING FUZZY HIDDEN MARKOV MODEL
Sign language recognition has spawned more and more interest in human–computer interaction society. The major challenge that SLR recognition faces now is developing methods that will scale well with increasing vocabulary size with a limited set of training data for the signer independent application. The automatic SLR based on hidden Markov models (HMMs) is very sensitive to gesture's shape inf...
متن کاملSymmetry in Probabilistic Databases
Researchers in databases, AI, and machine learning, have all proposed representations of probability distributions over relational databases (possible worlds). In a tuple-independent probabilistic database, the possible worlds all have distinct probabilities, because the tuple probabilities are distinct. In AI and machine learning, however, one typically learns highly symmetric distributions, w...
متن کاملA Fast Derandomization Schemes and Its Applications
We present a fast derandomization scheme for the PROFIT/COST problem. Through the applications of this scheme we show the time complexity of O(log 2 n loglog n) for the + 1 vertex coloring problem using O((m + n)= log logn) processors on the CREW PRAM, the time complexity of O(log 2:5 n) for the maximal independent set problem using O((m+n)= log 1:5 n) processors on the CREW PRAM and the time c...
متن کاملFormalizing Turing Machines
We discuss the formalization, in the Matita Theorem Prover, of a few, basic results on Turing Machines, up to the existence of a (certified) Universal Machine. The work is meant to be a preliminary step towards the creation of a formal repository in Complexity Theory, and is a small piece in our Reverse Complexity program, aiming to a comfortable, machine independent axiomatization of the field.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990